Linear independence of root equations forM/G/1 type Markov chains

نویسندگان

  • H. Richard Gail
  • Sidney L. Hantler
  • Moshe Sidi
  • B. A. Taylor
چکیده

There is a classical technique for determining the equilibrium probabilities of M/G/1 type Markov chains. After transforming the equilibrium balance equations of the chain, one obtains an equivalent system of equations in analytic functions to be solved. This method requires nding all singularities of a given matrix function in the unit disk and then using them to obtain a set of linear equations in the nite number of unknown boundary probabilities. The remaining probabilities and other measures of interest are then computed from the boundary probabilities. Under certain technical assumptions, the linear independence of the resulting equations is established by a direct argument involving only elementary results from matrix theory and complex analysis. Simple conditions for the ergodicity and nonergodicity of the chain are also given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Computational Aspects of the Invariant Subspace Approach to Teletraac Problems and Comparisons

A large class of teletraac problems are based on Markov chains of M/G/1 and G/M/1 type, the study of which requires numerically eecient and reliable algorithms to solve the nonlinear matrix equations arising in such chains. Given A i ; i 0, a sequence of square m-by-m nonnegative matrices and A(z) = P 1 i=0 A i z i with A(1) being an irreducible stochastic matrix, these equations for M/G/1 type...

متن کامل

A New Paradigm in Teletraffic Analysis of Communication Networks

A large class of teletraac analysis problems encountered in communication networks are based on Markov chains of M/G/1 and G/M/1 type, the study of which require numerically eecient and reliable algorithms to solve the nonlinear matrix equations arising in such chains. The traditional transform approach to solve these chains which requires root nding is known to cause problems when some roots a...

متن کامل

An Invariant Subspace Approach in M/g/1 and G/m/1 Type Markov Chains

Let A k ; k 0, be a sequence of mm nonnegative matrices and let A(z) = P 1 k=0 A k z k be such that A(1) is an irreducible stochastic matrix. The unique power-bounded solution of the nonlinear matrix equation G = P 1 k=0 A k G k has been shown to play a key role in the analysis of Markov chains of M/G/1 type. Assuming that the matrix A(z) is rational, we show that the solution of this matrix eq...

متن کامل

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

Evaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes

Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded  DNA virus. There were two approaches for prediction of each Markov Model parameter,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 1995